Completeness Theorems for Semantic Resolution in Consequence-Finding

نویسندگان

  • James R. Slagle
  • Chin-Liang Chang
  • Richard C. T. Lee
چکیده

The object of consequence-finding is to deduce l o g i c a l consequences from a set of axioms. The theory of J.R. S lag le ' s semantic reso lu t ion p r i n c i p l e , an inference ru l e fo r f i r s t o r d e r pred icate ca l cu lus , is extended to consequence-f inding. Given an i n t e r p r e t a t i o n I , i t is proved that any prime ( n o n t r i v i a l ) consequence, which is fa l se in I, can be der ived from a set of axioms by apply ing I (semant ic) r e s o l u t i o n .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completeness of Pruning Methods for Consequence Finding Procedure Sol ?

In this paper, we study the completeness of several types of pruning methods for the logical consequence nding procedure SOL-resolution. The consequence nd-ing problem is a generalization of the refutation nding problem. The SOL-resolution is a Model-Elimination-like calculus with Skip operation, and is one of the most signiicant calculi for consequence nding. The concept \completeness" of cons...

متن کامل

Consequence-Finding Based on Ordered Linear Resolution

Since linear resolution with clause ordering is incomplete for consequence-finding, it has been used mainly for proof-finding. In this paper, we re-evaluate consequence-finding. Firstly, consequence-finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found. Then, we show how adding a skip rule to ordered lin...

متن کامل

A New Method for Incremental Consequence-Finding

Consequence-finding is important to various reasoning problems, including knowledge compilation, abduction, nonmonotonic reasoning, and clause maintenance systems. The incremental version of the problem is also important because it is expensive to recompute a consequence set in response to the addition of new premises. In this paper, we present the first incremental consequencefinding method fo...

متن کامل

Suzuki-type fixed point theorems for generalized contractive mappings‎ ‎that characterize metric completeness

‎Inspired by the work of Suzuki in‎ ‎[T. Suzuki‎, ‎A generalized Banach contraction principle that characterizes metric completeness‎, Proc‎. ‎Amer‎. ‎Math‎. ‎Soc. ‎136 (2008)‎, ‎1861--1869]‎, ‎we prove a fixed point theorem for contractive mappings‎ ‎that generalizes a theorem of Geraghty in [M.A‎. ‎Geraghty‎, ‎On contractive mappings‎, ‎Proc‎. ‎Amer‎. ‎Math‎. ‎Soc., ‎40 (1973)‎, ‎604--608]‎an...

متن کامل

α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic

Based on the general form of -resolution principle for a lattice-valued logic with truth-values defined in a latticevalued logical algebra structure lattice implication algebra, the further extended -resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, -quasi-lock semantic resolution method in lat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1969